Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics
نویسندگان
چکیده
We study two widely used algorithms, Glauber dynamics and the Swendsen-Wang algorithm, on rectangular subsets of the hypercubic lattice Z. We prove that under certain circumstances, the mixing time in a box of side length L with periodic boundary conditions can be exponential in L. In other words, under these circumstances, the mixing in these widely used algorithms is not rapid; instead, it is torpid. The models we study are the independent set model and the q-state Potts model. For both models, we prove that Glauber dynamics is torpid in the region with phase coexistence. For the Potts model, we prove that Swendsen-Wang is torpid at the phase transition point.
منابع مشابه
Resampling Markov Chain Monte Carlo Algorithms: Basic Analysis and Empirical Comparisons
Sampling from complex distributions is an important but challenging topic in scientific and statistical computation. We synthesize three ideas, tempering, resampling, and Markov moving, and propose a general framework of resampling Markov chain Monte Carlo (MCMC). This framework not only accommodates various existing algorithms, including resample-move, importance resampling MCMC, and equi-ener...
متن کاملA Framework for Expressing and Estimating Arbitrary Statistical Models Using Markov Chain Monte Carlo
YADAS is a new open source software system for statistical analysis using Markov chain Monte Carlo. It is written with the goal of being extensible enough to handle any new statistical model and versatile enough to allow experimentation with different sampling algorithms. In this paper we discuss the design of YADAS and illustrate its power through five challenging examples that feature unusual...
متن کاملMarkov Chain Monte Carlo Methods in Statistical Physics
In this paper we shall briefly review a few Markov Chain Monte Carlo methods for simulating closed systems described by canonical ensembles. We cover both Boltzmann and non-Boltzmann sampling techniques. The Metropolis algorithm is a typical example of Boltzmann Monte Carlo method. We discuss the time-symmetry of the Markov chain generated by Metropolis like algorithms that obey detailed balanc...
متن کاملReplica exchange and expanded ensemble simulations as Gibbs sampling: simple improvements for enhanced mixing.
The widespread popularity of replica exchange and expanded ensemble algorithms for simulating complex molecular systems in chemistry and biophysics has generated much interest in discovering new ways to enhance the phase space mixing of these protocols in order to improve sampling of uncorrelated configurations. Here, we demonstrate how both of these classes of algorithms can be considered as s...
متن کاملThe Markov Chain Monte Carlo Method: an Approach to Approximate Counting and Integration
In the area of statistical physics, Monte Carlo algorithms based on Markov chain simulation have been in use for many years. The validity of these algorithms depends crucially on the rate of convergence to equilibrium of the Markov chain being simulated. Unfortunately, the classical theory of stochastic processes hardly touches on the sort of non-asymptotic analysis required in this application...
متن کامل